HYPER-WIENER INDEX OF ZIGZAG POLYHEX NANOTUBES

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Harary Index of Zigzag Polyhex Nanotorus

One of considerable topics in chemistry is surveying the quantitative structure-property relationship between the structure of a molecule and chemical, physical and biological properties of it(QSPR). For this purpose, the form of molecule must be coded according to numbers. A common method, for coding the molecule structure, is to assign a graph to the molecule, where the vertices are atoms of ...

متن کامل

Schultz Index of Armchair Polyhex Nanotubes

The study of topological indices - graph invariants that can be used for describing and predicting physicochemical or pharmacological properties of organic compounds - is currently one of the most active research fields in chemical graph theory. In this paper we study the Schultz index and find a relation with the Wiener index of the armchair polyhex nanotubes TUV C(6)[2p; q]. An exact expressi...

متن کامل

A new algorithm for computing distance matrix and Wiener index of zig-zag polyhex nanotubes

The Wiener index of a graph G is defined as the sum of all distances between distinct vertices of G. In this paper an algorithm for constructing distance matrix of a zig-zag polyhex nanotube is introduced. As a consequence, the Wiener index of this nanotube is computed.

متن کامل

MORE ON EDGE HYPER WIENER INDEX OF GRAPHS

‎Let G=(V(G),E(G)) be a simple connected graph with vertex set V(G) and edge‎ ‎set E(G)‎. ‎The (first) edge-hyper Wiener index of the graph G is defined as‎: ‎$$WW_{e}(G)=sum_{{f,g}subseteq E(G)}(d_{e}(f,g|G)+d_{e}^{2}(f,g|G))=frac{1}{2}sum_{fin E(G)}(d_{e}(f|G)+d^{2}_{e}(f|G)),$$‎ ‎where de(f,g|G) denotes the distance between the edges f=xy and g=uv in E(G) and de(f|G)=∑g€(G)de(f,g|G). ‎In thi...

متن کامل

The hyper-Wiener index of graph operations

Let G be a graph. The distance d(u,v) between the vertices u and v of the graph G is equal to the length of a shortest path that connects u and v. The Wiener index W(G) is the sum of all distances between vertices of G, whereas the hyper-Wiener index WW(G) is defined as WW(G)=12W(G)+12@?"{"u","v"}"@?"V"("G")d (u,v)^2. In this paper the hyper-Wiener indices of the Cartesian product, composition,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The ANZIAM Journal

سال: 2008

ISSN: 1446-1811,1446-8735

DOI: 10.1017/s1446181108000278